Efficient Two-Stage Group Testing Algorithms for Genetic Screening
نویسندگان
چکیده
منابع مشابه
Efficient Two-Stage Group Testing Algorithms for DNA Screening
Group testing algorithms are very useful tools for DNA library screening. Building on recent work by Levenshtein (2003) and Tonchev (2008), we construct in this paper new infinite classes of combinatorial structures, the existence of which are essential for attaining the minimum number of individual tests at the second stage of a two-stage disjunctive testing algorithm.
متن کاملEfficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing
In the k-junta testing problem, a tester has to efficiently decide whether a given function f : {0, 1} → {0, 1} is a kjunta (i.e., depends on at most k of its input bits) or is ε-far from any k-junta. Our main result is a quantum algorithm for this problem with query complexity Õ( √ k/ε) and time complexity Õ(n √ k/ε). This quadratically improves over the query complexity of the previous best q...
متن کاملTwo Models of Nonadaptive Group Testing for Designing Screening Experiments
We discuss two non-standard models of nonadaptive combinatorial search which develop the conventional disjunct search model [8] for a small number of defective elements contained in a finite ground set or a population. The first model called a search of defective supersets (complexes) was suggested in [15, 16]. The second model which can be called a search of defective subsets in the presence o...
متن کاملTwo Efficient Real-coded Genetic Algorithms for Real Parameter Optimization
This paper presents an efficient generation alternation model for real-coded genetic algorithm called rc-CGA. The most important characteristic of the proposed rcCGA model is the implicit self-adaptive feature in its crossover and mutation mechanism. By applying two crossover operators (BLX-α and UNDX crossover) in conjunction with Non-Uniform mutation to rc-CGA, respectively, we define two new...
متن کاملTwo-Stage Sensitivity-Based Group Screening in Computer Experiments
Sophisticated computer codes that implement mathematical models of physical processes can take hours to produce a single response. Screening to determine the most active inputs is critical for understanding the input-output relationship. This paper presents new methodology based on two-stage group screening. In stage 1, groups of inputs are screened out and, at stage 2, individual active inputs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9791-2